Nondominated coteries on graphs
نویسندگان
چکیده
منابع مشابه
Nondominated Coteries on Graphs
Let C and D be two distinct coteries under the vertex set V of a graph G = (V, E) that models a distributed system. Coterie C is said to G-dominate D (with respect to G) if the following condition holds: For any connected subgraph H of G that contains a quorum in D (as a subset of its vertex set), there exists a connected subgraph H ¢ of H that contains a quorum in C. A coterie C on a graph G i...
متن کاملTransformations on Regular Nondominated Coteries and Their Applications
A coterie under an underlying set U is a family of subsets of U such that every pair of subsets has at least one element in common, but neither is a subset of the other. A coterie C under U is said to be nondominated (ND) if there is no other coterie D under U such that, for every Q ∈ C, there exists Q ∈ D satisfying Q ⊆ Q. We introduce the operation σ which transforms a ND coterie to another N...
متن کاملNondominated k-Coteries for Multiple Mutual Exclusion
Quorum-based mutual exclusion algorithms are resilient to node and communication line failures. In order to enter its critical section, a node must obtain permission from a quorum of nodes. A collection of quorums is called a coterie. The most resilient coteries are called nondominated coteries. Recently, k-coteries were proposed to be used in mutual exclusion algorithms that allow up to k entr...
متن کاملNondominated local coteries for resource allocation in grids and clouds
The resource allocation problem is a fundamental problem in Grid and Cloud computing environments. This paper focuses on constructing nondominated (ND) local coteries to solve the problem in a distributed way. Distributed algorithms using coteries usually incur low communication overhead and have high degree of fault-tolerance, and ND coteries are candidates for the algorithms to achieve the hi...
متن کاملConstructing Nondominated Local Coteries for Distributed Resource Allocation
The resource allocation problem is a fundamental problem in distributed systems. In this paper, we focus on constructing nondominated (ND) local coteries to solve the problem. Distributed algorithms using coteries usually incur low communication overhead and have high degree of fault-tolerance, and ND coteries are candidates for the algorithms to achieve the highest degree of fault-tolerance. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 1997
ISSN: 1045-9219
DOI: 10.1109/71.595585